Random Triangles III

نویسنده

  • Steven Finch
چکیده

Let Ω be a compact convex set in Euclidean n-space with nonempty interior. Random triangles are defined here by selecting three independent uniformly distributed points in Ω to be vertices. Generating such points for (n,Ω) = (2,unit square) or (n,Ω) = (3,unit cube) is straightforward. For (n,Ω) = (2,unit disk) or (n,Ω) = (3,unit ball), we use the following result [1]. Let X1, X2, X3, Y1, Y2, Y3, Z1, Z2, Z3 be independent normally distributed random variables with mean 0 and variance 1/2. Let W1, W2, W3 be exponential random variables, independent of the others, with mean 1. Then the points

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Similar Triangles, Another Trace of the Golden Ratio

In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.

متن کامل

A zero-one law for the existence of triangles in random key graphs

Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law for the appearance of triangles, and identify the corresponding critical scaling. This is done by applying the method of first and second moments to the number of triangles i...

متن کامل

A local central limit theorem for triangles in a random graph

In this paper, we prove a local limit theorem for the distribution of the number of triangles in the Erdos-Renyi random graph G(n, p), where p ∈ (0, 1) is a fixed constant. Our proof is based on bounding the characteristic function ψ(t) of the number of triangles, and uses several different conditioning arguments for handling different ranges of t.

متن کامل

Divide and conquer martingales and the number of triangles in a random graph

The goal of this paper is to present a novel application of a recent and useful martingale inequality. As an illustration, we prove an essentially sharp bound for the probability that a random graph contains significantly more triangles than expected.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010